We generalize, by a progressive procedure, the notions of conjunction and disjunction of two conditional events to the case of n conditional events. In our coherence-based approach, conjunctions and disjunctions are suitable conditional random quantities. We define the notion of negation, by verifying De Morgan’s Laws. We also show that conjunction and disjunction satisfy the associative and commutative properties, and a monotonicity property. Then, we give some results on coherence of prevision assessments for some families of compounded conditionals; in particular (...) we examine the Fréchet-Hoeffding bounds. Moreover, we study the reverse probabilistic inference from the conjunction Cn+1 of n + 1 conditional events to the family {Cn,En+1|Hn+1}. We consider the relation with the notion of quasi-conjunction and we examine in detail the coherence of the prevision assessments related with the conjunction of three conditional events. Based on conjunction, we also give a characterization of p-consistency and of p-entailment, with applications to several inference rules in probabilistic nonmonotonic reasoning. Finally, we examine some non p-valid inference rules; then, we illustrate by an example two methods which allow to suitably modify non p-valid inference rules in order to get inferences which are p-valid. (shrink)

This text centers around three main subjects. The first is the concept of modularity and independence in classical logic and nonmonotonic and other nonclassical logic, and the consequences on syntactic and semantical interpolation and language change. In particular, we will show the connection between interpolation for nonmonotonic logic and manipulation of an abstract notion of size. Modularity is essentially the ability to put partial results achieved independently together for a global result. The second aspect of the book (...) is the authors' uniform picture of conditionals, including many-valued logics and structures on the language elements themselves and on the truth value set. The third topic explained by the authors is neighbourhood semantics, their connection to independence, and their common points and differences for various logics, e.g., for defaults and deontic logic, for the limit version of preferential logics, and for general approximation"--Publisher. (shrink)

Rolando Chuaqui y yo, nos encontramos una ´ unica vez, en Bah´ıa Blanca en agosto 1992, en el Simposio Latino- Americano de L´ ogica Matem´ atica. Lamentablemente, Chuaqui muri´ o antes de mi pr´ oxima visita a Am´ erica del Sur, igual que otro gran l´ ogico latinoamericano, Carlos Alchourr´ on. Chuaqui estuvo en Bah´ıa Blanca juntos con varios alumnos que hablaron sobre aspectos de la l´.

It is a commonplace of the history of analytic philosophy that Carnap swiftly adopted Tarskian semantics in the mid-1930s. There is no doubt that, in a very general sense, this is true. But to what extent are the innovative technical details characteristic of Tarski's method, specifically the handling of quantification by way of a satisfaction relation between formulas and variable assignments, reflected in Carnap's writings on semantics? Curiously enough, their essentials are in place just before Carnap took the purported (...) Tarskian turn, namely in the definition of analyticity he formulated some time between September 1932 and April 1933, but are missing from his publications on semantics after 1935 until the final chapter of Meaning and Necessity of 1947, at which point we find Carnap reverting to the use of specifically Tarskian techniques in the context of his novel semantics for quantified modal languages. (shrink)

We present a framework that provides a logic for science by generalizing the notion of logical (Tarskian) consequence. This framework will introduce hierarchies of logical consequences, the first level of each of which is identified with deduction. We argue for identification of the second level of the hierarchies with inductive inference. The notion of induction presented here has some resonance with Popper's notion of scientific discovery by refutation. Our framework rests on the assumption of a restricted class of structures (...) in contrast to the permissibility of classical first-order logic. We make a distinction between deductive and inductive inference via the notions of compactness and weak compactness. Connections with the arithmetical hierarchy and formal learning theory are explored. For the latter, we argue against the identification of inductive inference with the notion of learnable in the limit. Several results highlighting desirable properties of these hierarchies of generalized logical consequence are also presented. (shrink)

In this paper I consider whether there is a measure of coherence that could be rightly claimed to generalize the notion of logical equivalence. I show that Fitelson’s (2003) proposal to that effect encounters some serious difficulties. Furthermore, there is reason to believe that no mutual-support measure could ever be suitable for the formalization of coherence as generalized logical equivalence. Instead, it appears that the only plausible candidate for such a measure is one of relative overlap. The measure I propose (...) in this paper is quite similar to Olsson’s (2002) proposal but differs from it by not being susceptible to the type of counterexample that Bovens and Hartmann (2003) have devised against it. (shrink)

The book presents a thoroughly elaborated logical theory of generalized truth-values understood as subsets of some established set of truth values. After elucidating the importance of the very notion of a truth value in logic and philosophy, we examine some possible ways of generalizing this notion. The useful four-valued logic of first-degree entailment by Nuel Belnap and the notion of a bilattice constitute the basis for further generalizations. By doing so we elaborate the idea of a multilattice, and (...) most notably, a trilattice of truth values – a specific algebraic structure with information ordering and two distinct logical orderings, one for truth and another for falsity. Each logical order not only induces its own logical vocabulary, but determines also its own entailment relation. We consider both semantic and syntactic ways of formalizing these relations and construct various logical calculi. (shrink)

In the Critique of Pure Reason, Kant uses the term “logic” in a bewildering variety of ways, at times making it close to impossible to determine whether he is referring to (among others) general logic, transcendental logic, transcendental analytic, a "special" logic relative to a specific science, a "natural" logic, a logic intended for the "learned" (Gelehrter), some hybrid of these logics, or even some still-more abstract notion that ranges over all of these (...) uses. This paper seeks to come to grips with Kant's complex use of "logic." Kant is standardly regarded as saying that since Aristotle, there need be no more concern about logic as a discipline or a field of study, and that Aristotle (with some minor embellishments, in terms of presentation) is the last word in logic. I argue here that, in spite of Hegel, Peirce, Strawson, and others, one must take into consideration Kant’s sophisticated critique of Aristotle’s logic in order to see Kant’s own conception of logic in contrast to that of Aristotle’s. In this way, Kant's strategy in the First Critique—grounded as it is in logic—becomes more plausible, defensible, and, consequently, more attractive. (shrink)

We argue that the extant evidence for Stoic logic provides all the elements required for a variable-free theory of multiple generality, including a number of remarkably modern features that straddle logic and semantics, such as the understanding of one- and two-place predicates as functions, the canonical formulation of universals as quantified conditionals, a straightforward relation between elements of propositional and first-order logic, and the roles of anaphora and rigid order in the regimented sentences that express multiply (...) class='Hi'>general propositions. We consider and reinterpret some ancient texts that have been neglected in the context of Stoic universal and existential propositions and offer new explanations of some puzzling features in Stoic logic. Our results confirm that Stoic logic surpasses Aristotle’s with regard to multiple generality, and are a reminder that focusing on multiple generality through the lens of Frege-inspired variable-binding quantifier theory may hamper our understanding and appreciation of pre-Fregean theories of multiple generality. (shrink)

This chapter contains sections titled: Introduction Statements The Square of Opposition Figure and Mood Deduction Counterexamples Independence Soundness Completeness: Syllogistic Arguments Completeness: Categorical Arguments Completeness: Arguments in General Note Bibliography.

There are two ways interpreters have tended to understand the nature of the laws of Kant’s pure general logic. On the first, these laws are unconditional norms for how we ought to think, and will govern anything that counts as thinking. On the second, these laws are formal criteria for being a thought, and violating them makes a putative thought not a thought. These traditions are in tension, in so far as the first depends on the possibility of (...) thoughts that violate these laws, and the second makes violation impossible. In this essay I develop an interpretation of Kant’s pure general logic that overcomes this tension. It accounts for the possibility of logical mistakes, as the first tradition does, while still establishing the absolute impossibility of logical aliens, as the second tradition does. I then argue that the formalist insight that illogical exercises of the understanding are not alternative ways coherent thoughts could have been, but are mere confusions, is fundamental for achieving a proper understanding of the absolute normativity of the laws of pure general logic. (shrink)

In this paper we make an attempt to study classes of models by using general logics. We do not believe that Lww is always the best logic for analyzing a class of models. Let K be a class of models and L a logic. The main assumptions we make about K and C are that K has the L-amalgamation property and, later in the paper, that K does not omit L-types. We show that, if modified suitably, most (...) of the results of stability theory hold in this context. The main difference is that existentially closed models of K play the role that arbitrary models play in traditional stability theory. We prove e. g. a structure theorem for the class of existentially closed models of K assuming that K is a trivial superstable class with ndop. (shrink)

Correspondence analysis is Kooi and Tamminga’s universal approach which generates in one go sound and complete natural deduction systems with independent inference rules for tabular extensions of many-valued functionally incomplete logics. Originally, this method was applied to Asenjo–Priest’s paraconsistent logic of paradox LP. As a result, one has natural deduction systems for all the logics obtainable from the basic three-valued connectives of LP -language) by the addition of unary and binary connectives. Tamminga has also applied this technique to the (...) paracomplete analogue of LP, strong Kleene logic \. In this paper, we generalize these results for the negative fragments of LP and \, respectively. Thus, the method of correspondence analysis works for the logics which have the same negations as LP or \, but either have different conjunctions or disjunctions or even don’t have them as well at all. Besides, we show that correspondence analyses for the negative fragments of \ and LP, respectively, are also suitable without any changes for the negative fragments of Heyting’s logic \ and its dual \ and LP). (shrink)

This paper reports on an approach to model generalized implicatures using nonmonotonic logics. The approach, called compositional, is based on the idea of compositional semantics, where the implicatures carried by a sentence are constructed from the implicatures carried by its constituents, but it also includes some aspects nonmonotonic logics in order to model the defeasibility of generalized implicatures.

This paper sheds light on the relationship between the logic of generalized truth values and the logic of bilattices. It suggests a definite solution to the problem of axiomatizing the truth and falsity consequence relations, \ and \ , considered in a language without implication and determined via the truth and falsity orderings on the trilattice SIXTEEN 3 . The solution is based on the fact that a certain algebra isomorphic to SIXTEEN 3 generates the variety of commutative (...) and distributive bilattices with conflation. (shrink)

Accretive and monotone operator theory are central branches of nonlinear functional analysis and constitute the abstract study of certain set-valued mappings between function spaces. This paper deals with the computational properties of these accretive and (generalized) monotone set-valued operators. In particular, we develop (and extend) for this field the theoretical framework of proof mining, a program in mathematical logic that seeks to extract computational information from prima facie “non-computational” proofs from the mainstream literature. To this end, we establish logical (...) metatheorems that guarantee and quantify the computational content of theorems pertaining to accretive and (generalized) monotone set-valued operators. On the one hand, our results unify a number of recent case studies, while they also provide characterizations of central analytical notions in terms of proof theoretic ones on the other, which provides a crucial perspective on needed quantitative assumptions in future applications of proof mining to these branches. (shrink)

We introduce generalized quantifiers, as defined in Tarskian semantics by Mostowski and Lindström, in logics whose semantics is based on teams instead of assignments, e.g., IF-logic and Dependence logic. Both the monotone and the non-monotone case is considered. It is argued that to handle quantifier scope dependencies of generalized quantifiers in a satisfying way the dependence atom in Dependence logic is not well suited and that the multivalued dependence atom is a better choice. This atom is in (...) fact definably equivalent to the independence atom recently introduced by Väänänen and Grädel. (shrink)

The paper contains a survey of (mainly unpublished) adaptive logics of inductive generalization. These defeasible logics are precise formulations of certain methods. Some attention is also paid to ways of handling background knowledge, introducing mere conjectures, and the research guiding capabilities of the logics.

In the paper, I have presented a portrait of Jerzy Pelc as a teacher. He followed in the footsteps of Kazimierz Twardowski and his direct disciples and tried to develop his students’ skills of critical thinking and clear speaking—the basics of good work in philosophy. These skills are connected with methodological postulates of criticism and precision which were shared by all the members of the Lvov-Warsaw School. Jerzy Pelc treated these postulates also as didactic postulates arising out of the conceptions (...) of logical culture and general logic. In my article, I have sketched a general picture of the relation between logic and didactics, I have presented the aforementioned postulates, the concepts of logical culture and general logic and its curriculum. (shrink)

The stated subject of these lecture courses given by Husserlbetween 1910 and 1918is ‘reason, the word for the mental activities and accomplishments that govern knowledge, give it form and supply it with norms.’ They show their author still pursuing the course set out in the Logical Investigations up to the end of the second decade of the century and displaying utter consistency with stands that he began taking on meaning, analyticity, Platonism, manifolds, mathematics, psychologism, etc. in the 1890s. Thus, they (...) undermine many idées reçues about the development of his thought. The centerpiece of this work is an exploration of the realm of meaning. Moreover, they add new dimensions to standard discussions by taking readers back to the place where phenomenology and analytic philosophy diverged. They show that Husserl tangled long and hard with the very ideas that went into the making of the latter and offer a wealth of interesting insights into sense and meaning, theory of judgment, complete and incomplete meanings, states of affairs, extensional logic, the relationship between logic and mathematics, functions and arguments, propositional functions, quantification, existential generalization, the word ‘all,’ number theory, sets, modality, deductive theory, ideas that are still under discussion today. Prepared for oral delivery in the classroom, they are refreshingly lively and spontaneous. They are clearer, more explicit, and readable than the books Husserl published during his lifetime. (shrink)

This paper sets out a philosophical interpretation of the model theory of Mares and Goldblatt (The Journal of Symbolic Logic 71, 2006). This interpretation distinguishes between truth conditions and information conditions. Whereas the usual Tarskian truth condition holds for universally quantified statements, their information condition is quite different. The information condition utilizes general propositions . The present paper gives a philosophical explanation of general propositions and argues that these are needed to give an adequate theory of (...) class='Hi'>general information. (shrink)

We prove the canonical models introduced in [D] do not exist for some graded normal logics with symmetric models, namelyKB°, KBD°, KBT°, so that we define a new kind of canonical models, the general ones, and show they exist and work well in every case.

This article seeks to explore some issues regarding the different modes of generality at stake in the formation of transdisciplinary concepts within the production of ‘theory’ in the humanities and social sciences. Focused around Jacques Derrida’s seminal account of ‘writing’ in his 1967 book Of Grammatology, the article outlines what it defines as a logic of generalization at stake in Derrida’s elaborations of a quasi-transcendental ‘inscription in general’. Starting out from the questions thereby raised about the relationship between (...) such forms of generality and those historically ascribed to philosophy, the article concludes by contrasting Derrida’s generalized writing with more recent returns to ‘metaphysics’ in the work of Bruno Latour and others. Against the immediately ‘ontological’ orientation of much recent ‘new materialist’ or ‘object-oriented’ thought, the article argues for the necessity of ‘different levels of writing in general’ through a continual folding back of absolute generalization into historically specific disciplinary crossings and exchanges; something suggested by but never really developed in Derrida’s own work. (shrink)

This is a personal, incomplete, and very informal take on the role of logic in general philosophy of science, which is aimed at a broader audience. We defend and advertise the application of logical methods in philosophy of science, starting with the beginnings in the Vienna Circle and ending with some more recent logical developments.

We show how sequent calculi for some generalized quantifiers can be obtained by generalizing the Herbrand approach to ordinary first order proof theory. Typical of the Herbrand approach, as compared to plain sequent calculus, is increased control over relations of dependence between variables. In the case of generalized quantifiers, explicit attention to relations of dependence becomes indispensible for setting up proof systems. It is shown that this can be done by turning variables into structured objects, governed by various types of (...) structural rules. These structured variables are interpreted semantically by means of a dependence relation. This relation is an analogue of the accessibility relation in modal logic. We then isolate a class of axioms for generalized quantifiers which correspond to first-order conditions on the dependence relation. (shrink)

Dynamic epistemic logic (DEL) extends purely modal epistemic logic (S5) by adding dynamic operators that change the model structure. Propositional dynamic logic (PDL) extends basic modal logic with programs that allow the de nition of complex modalities. We provide a common generalisation: a logic that is dynamic in both senses, and one that is not limited to S5 as its modal base. It also incorporates, and signi cantly generalises, all the features of existing extensions of (...) DEL such as BMS [3] and LCC [21]. Our dynamic operators work in two steps. First, they provide a multiplicity of transformations of the original model, one for each action in a purely syntactic action structure (in the style of BMS). Second, they specify how to combine these multiple copies to produce a new model. In each step, we use the generality of PDL to specify the transformations. The main technical contribution of the paper is to provide an axiomatisation of this general dynamic dynamic logic (GDDL). This is done by providing a computable translation of GDDL formulas to equivalent PDL formulas, thus reducing the logic to PDL, which is decidable. The proof involves switching between representing programs as terms and as automata. We also show that both BMS and LCC are special cases of GDDL, and that there are interesting applications that require the additional generality of GDDL, namely the modelling of private belief update. More recent extensions and variations of BMS and LCC are also discussed. (shrink)

On the Fregean view of NP's, quantified NP's are represented as operator-variable structures while proper names are constants appearing in argument position. The Generalized Quantifier approach characterizes quantified NP's and names as elements of a unified syntactic category and semantic type. According to the Logicality Thesis, the distinction between quantified NP's, which undergo an operation of quantifier raising to yield operator-variable structures at Logical Form and non-quantified NP's, which appear in situ at LF, corresponds to a difference in logicality status. (...) The former are logical expressions while the latter are not. Using van Benthem's [2, 3] criterion for logicality, I extend the concept of logicality to GQ's. I argue that NP's modified by exception phrases constitute a class of quantified NP's which are heterogeneous with respect to logicality. However, all exception phrase NP's exhibit the syntactic and semantic properties which motivate May to treat quantified NP's as operators at LF. I present a semantic analysis of exception phrases as modifiers of GQ's, and I indicate how this account captures the central semantic properties of exception phrase NP's. I explore the consequences of the logically heterogeneous character of exception phrase NP's for proof theoretic accounts of quantifiers in natural language. The proposed analysis of exception phrase NP's provides support for the GQ approach to the syntax and semantics of NP's. (shrink)

The paper presents an interpretation of the thinking behind the early Wittgenstein's "general form of the proposition." It argues that a central role is played by the assumption that all domains of discourse are governed by the same laws of logic. The interpretation is presented partly through a comparison with ideas presented recently by Michael Potter and Peter Sullivan; the paper argues that the above assumption explains more of the key characteristics of the "general form of the (...) proposition" than Potter and Sullivan suppose, including, in particular, its claim that the bases from which all other propositions are derived must be elementary propositions. (shrink)

We develop a semantics for independence logic with respect to what we will call general models. We then introduce a simpler entailment semantics for the same logic, and we reduce the validity problem in the former to the validity problem in the latter. Then we build a proof system for independence logic and prove its soundness and completeness with respect to entailment semantics.

TheGenerales Inquisitiones de Analysi Notionum et Veritatumis Leibniz’s most substantive work in the area of logic. Leibniz’s central aim in this treatise is to develop a symbolic calculus of terms that is capable of underwriting all valid modes of syllogistic and propositional reasoning. The present paper provides a systematic reconstruction of the calculus developed by Leibniz in theGenerales Inquisitiones. We investigate the most significant logical features of this calculus and prove that it is both sound and complete with respect (...) to a simple class of enriched Boolean algebras which we call auto-Boolean algebras. Moreover, we show that Leibniz’s calculus can reproduce all the laws of classical propositional logic, thus allowing Leibniz to achieve his goal of reducing propositional reasoning to algebraic reasoning about terms. (shrink)

By using the notions of exact truth and exact falsity, one can give 16 distinct definitions of classical consequence. This paper studies the class of relations that results from these definitions in settings that are paracomplete, paraconsistent or both and that are governed by the Strong Kleene schema. Besides familiar logics such as Strong Kleene logic, the Logic of Paradox and First Degree Entailment, the resulting class of all Strong Kleene generalizations of classical logic also contains a (...) host of unfamiliar logics. We first study the members of our class semantically, after which we present a uniform sequent calculus that is sound and complete with respect to all of them. Two further sequent calculi and \ calculus) will be considered, which serve the same purpose and which are obtained by applying general methods to construct sequent calculi for many-valued logics. Rules and proofs in the SK calculus are much simpler and shorter than those of the \ and the \ calculus, which is one of the reasons to prefer the SK calculus over the latter two. Besides favourably comparing the SK calculus to both the \ and the \ calculus, we also hint at its philosophical significance. (shrink)

As consistency is such an important topic in logic, researchers have for a long time investigated how to attain and maintain it. But consistency can also be studied from the point of view of its opposite, inconsistency. The problem with inconsistency in classical logic is that by the principle of explosion a single inconsistency leads to triviality. Paraconsistent logics were introduced to get around this problem by defining logics in such a way that the explosion principle does not (...) apply to them. Another approach stays in the classical framework and evaluates the amount of inconsistency in a set of formulas. The great bulk of this work has been done for propositional logic and presents many interesting issues about inconsistency. A previous paper introduced the concept of generalized propositional logic (GPL) to provide a uniform method for measuring inconsistency in logics that allow the application of unary operator pairs, such as for modality, time, and space, to propositional logic formulas. The universality of GPL manifests itself in the fact that such an operator pair is evaluated in a uniform manner across all such logics. The difference lies solely in the choice of a frame for each logic. But some logics also contain nonunary operators. For example, temporal logics typically contain a binary Until operator. The purpose of this paper is to show how to extend generalized propositional logic to extended generalized propositional logic (EGPL) by adding nonunary operator pairs and measure inconsistency in such logics. The universality of EGPL manifests itself in the fact that once the evaluation of the nonunary operators is given, it carries over to all such logics. For example, the temporal Until operator becomes applicable to modal logic. Furthermore, while relative inconsistency measures were previously considered for GPL, they are now extended to EGPL and a new approach removes an undesirable feature from the previous version. Also, this paper provides results about various properties of the new inconsistency measures. Many examples and explanations are given to illustrate the issues involving this extension. (shrink)

The Greenberger–Horne–Zeilinger argument against noncontextual local hidden variables is recast in quantum logical terms of fundamental propositions, states and probabilities. Unlike Kochen–Specker- and Hardy-like configurations, this operator based argument proceeds within four nonintertwining contexts. The nonclassical performance of the GHZ argument is due to the choice or filtering of observables with respect to a particular state. We study the varieties of GHZ games one could play in these four contexts, depending on the chosen state of the GHZ basis.

My aim is to examine logical types in _Principia Mathematica_ from two (partly independent) perspectives. The first one pertains to the ambiguity of the notion of logical type as introduced in the Introduction (to the first edition). I claim that a distinction has to be made between types as called for in the context of paradoxes, and types as logical prototypes. The second perspective bears on typical ambiguity as described in Russell and Whitehead’s “Prefatory Statement of Symbolic Conventions”, inasmuch as (...) it lends itself to a comparison with specific systems of modern typed lambda-calculus. In particular, a recent paper shows that the theory of logical types can be formalized in the way of a lambda-calculus. This opens the way to an interesting reconciliation between type theories in the Russellian sense of the word, and type theories in the modern sense. But typical ambiguity is not taken into account in the paper. I would like to take up that question of typical ambiguity, by extending the typed lambda-calculus to be used. (shrink)

I subscribe to and defend frege's view that concepts are essentially predicative such that they can never occur as subjects of predication, Arguing against recent contentions of geach and strawson to the effect that (a) some general terms can so occur; (b) that 'anything whatever' can be a subject of predication. I discuss in detail frege's treatment of universally quantified propositions, Particular propositions, And unquantified propositions arguing that his thesis can be defended in each type of case.

DEALING INITIALLY WITH QC, THE STANDARD QUANTIFICATIONAL CALCULUS OF ORDER ONE, THE AUTHOR COMMENTS ON A SHORTCOMING, REPORTED IN 1956 BY MONTAGUE AND HENKIN, IN CHURCH'S ACCOUNT OF A PROOF FROM HYPOTHESES, AND SKETCHES THREE WAYS OF RIGHTING THINGS. THE THIRD, WHICH EXPLOITS A TRICK OF FITCH'S, IS THE SIMPLEST OF THE THREE. THE AUTHOR INVESTIGATES IT SOME, SUPPLYING FRESH PROOF OF UGT, THE UNIVERSAL GENERALIZATION THEOREM. THE PROOF HOLDS GOOD AS ONE PASSES FROM QC TO QC asterisk , THE (...) PRESUPPOSITION-FREE VARIANT OF QC. TURNING NEXT TO QC subscript = , THE STANDARD QUANTIFICATIONAL CALCULUS OF ORDER ONE WITH '=', AND TO THE PRESUPPOSITION-FREE VARIANT QC subscript = OF QC subscript = , THE AUTHOR NEXT ESTABLISHES THE LEMMAS NEEDED THERE TO PROVE UGT. THAT, GIVEN FITCH'S ACCOUNT OF A PROOF FROM HYPOTHESES, UGT HOLDS FOR QC subscript = WAS ARGUED IN LEBLANC'S "TRUTH-VALUE SEMANTICS", BUT THE PROOF WAS IN ERROR. (shrink)

In this paper we define and study a generalized notion of a logical system that covers on an equal formal basis sentential, equational and sequential systems. We develop a general theory of equivalence between generalized logics that provides, first, a conception of algebraizable logic , second, a formal concept of equivalence between sequential systems and, third, a notion of equivalence between sentential and sequential systems. We also use our theory of equivalence for developing a general algebraic approach (...) to conjunctive non-pseudo-axiomatic self-extensional sentential logics. Finally, we consider within the framework of the mentioned approach various sequential formulations for some well-known sentential logics. (shrink)

In this paper I lay the foundations for an understanding of one of Fichte's most neglected and least understood texts: the late lecture course on Transcendental Logic. I situate this work in the context of Fichte's lifelong struggle with the problem of understanding the relation between logic and philosophy – a problem that I show to figure centrally both in Fichte's own revolutionary thinking and in his response to Kant's notorious denunciation of the Wissenschaftslehre. By attending to this (...) context we can understand Fichte's philosophical ambitions in the late lectures: a critique of particular doctrines of general logic; a critique of the conception of thought presupposed both by the traditional logic and by Kant himself; and a new conception of the relation between logic and the philosophical theory of experience. (shrink)

Frege claims that the laws of logic are characterized by their “generality,” but it is hard to see how this could identify a special feature of those laws. I argue that we must understand this talk of generality in normative terms, but that what Frege says provides a normative demarcation of the logical laws only once we connect it with his thinking about truth and science. He means to be identifying the laws of logic as those that appear (...) in every one of the scientific systems whose construction is the ultimate aim of science, and in which all truths have a place. Though an account of logic in terms of scientific systems might seem hopelessly antiquated, I argue that it is not: a basically Fregean account of the nature of logic still looks quite promising. (shrink)

In the Critique of Pure Reason, Kant conceives of general logic as a set of universal and necessary rules for the possibility of thought, or as a set of minimal necessary conditions for ascribing rationality to an agent . Such a conception, of course, contrasts with contemporary notions of formal, mathematical or symbolic logic. Yet, in so far as Kant seeks to identify those conditions that must hold for the possibility of thought in general, such conditions (...) must hold a fortiori for any specific model of thought, including axiomatic treatments of logic and standard natural deduction models of first-order predicate logic. Kant's general logic seeks to isolate those conditions by thinking through – or better, reflecting on – those conditions that themselves make thought possible. (shrink)

The paper uses the theory of generalized quantifiers to discuss existential import and its implications for Aristotelian logic, namely the square of opposition, conversions and the assertoric syllogistic, as well as for more recent generalizations to intermediate quantifiers like “most”. While this is a systematic discussion of the semantic background one should assume in order to obtain the inferences and oppositions Aristotle proposed, it also sheds some light on the interpretation of his writings. Moreover by applying tools from modern (...) formal semantics to the investigation of classical Aristotelian logic and its extensions, we combine different approaches to the logic of quantification. We will present variants of quantifiers that are associated to the four corners of the square of opposition with and without existential import and discuss their role for the logical square, conversions and the syllogistic. It will turn out that there is no way to ascribe existential import that validates all inferences and relations which one is willing to hold in Aristotelian logic. Two options, however, provide reasonable results. Existential import should either be ascribed only to affirmative statements or only be ascribed to universal quantification. The former option is preferable for a mere reconstruction of the classical Aristotelian logic while the latter option is more attractive if Aristotelian logic is generalized to intermediate quantifiers. (shrink)

This article focuses on the interpretation of the metaphysical deductions of the higher cognitive faculties in Gabriele Gava’s Kant’s Critique of Pure Reason and the Method of Metaphysics. The aim is to assess the role that Kant’s general logic plays in these metaphysical deductions, the consequences for the analysis of the faculties, and the place of general logic in Gava’s overall theoretical analysis of Kant’s first Critique.

Consistency is one of the key concepts of logic; logicians have put a great deal of effort into proving the consistency of many logics. Understanding what causes inconsistency is also important; some logicians have developed paraconsistent logics that, unlike classical logics, allow some contradictions without making all formulas provable. Another direction of research studies inconsistency by measuring the amount of inconsistency of sets of formulas. While the initial attempt in 1978 was too ambitious in trying to do this for (...) first-order logic, this research got a substantial boost when an inconsistency measure was proposed for propositional logic in 2002. Since then, researchers in logic and artificial intelligence have made many interesting proposals and found related issues. Almost all of this work has been done for propositional logic. The purpose of this paper is to extend inconsistency measures to logics that also contain operators, such as modal operators. We use the terminology “generalized propositional logic” for such logics. We show how to extend propositional inconsistency measures to sets of formulas in any such generalized propositional logic. Examples are used to illustrate how various modal operators, including spatial and tense operators, fit into this framework. We also show that the addition of operators leads to a weak type of inconsistency. In all cases, the calculations for several inconsistency measures are given. (shrink)

Many commentators have attempted to say, more clearly than Wittgenstein did in his Tractatus logico-philosophicus, what sort of things the ‘simple objects’ spoken of in that book are. A minority approach, but in my view the correct one, is to reject all such attempts as misplaced. The Tractarian notion of an object is categorially indeterminate: in contrast with both Frege's and Russell's practice, it is not the logician's task to give a specific categorial account of the internal structure of elementary (...) propositions or atomic facts, nor, correlatively, to give an account of the forms of simple objects. The few commentators who have hitherto maintained this view have mainly devoted themselves to establishing that this was Wittgenstein's intention, and do not much address the question why Wittgenstein held that it is not the logician's business to say what the objects are. The present paper means to fill this lacuna by placing this view in the context of the Tractatus's treatment of logic generally, and in particular by connecting it with Wittgenstein's treatment of generality and with his reaction to Russell's approach to logical form. (shrink)

We analyse the two definitions of generalized quantifiers for logics of dependence and independence that have been proposed by F. Engström, comparing them with a more general, higher order definition of team quantifier. We show that Engström’s definitions can be identified, by means of appropriate lifts, with special classes of team quantifiers. We point out that the new team quantifiers express a quantitative and a qualitative component, while Engström’s quantifiers only range over the latter. We further argue that Engström’s (...) definitions are just embeddings of the first-order generalized quantifiers into team semantics, and fail to capture an adequate notion of team-theoretical generalized quantifier, save for the special cases in which the quantifiers are applied to flat formulas. We also raise several doubts concerning the meaningfulness of the monotone/nonmonotone distinction in this context. In the appendix we develop some proof theory for Engström’s quantifiers. (shrink)

The aim of the essay is to devise a logic of conditionality which escapes the paradoxes which arise when the general conditional is identified with the universalization of the material conditional. The assumption I adopt is that the logic of one contingent form differs from that of another to the extent that the two forms have different confirmations and disconfirmations. The logic of conditionals is not, But that of their confirmations and disconfirmations is, At bottom truth-Functional; (...) and the logical relations between conditionals, And between conditionals and non-Conditionals, May be traced through the truth-Functional connections between their respective confirmations and disconfirmations. The approach necessitates the re-Definition of the notions of confirmation and entailment. A peculiarity of the system which emerges is that from it can be derived, Without existential assumptions, The twenty-Four valid forms of the syllogism, The relationships of the square of opposition and the other commonly accepted inferences of traditional logic. (shrink)

We characterize (both from a syntactic and an algebraic point of view) the normal K4-logics for which unification is filtering. We also give a sufficient semantic criterion for existence of most general unifiers, covering natural extensions of K4.2⁺ (i.e., of the modal system obtained from K4 by adding to it, as a further axiom schemata, the modal translation of the weak excluded middle principle).